On simulating non-returning PC grammar systems with returning systems

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Size Complexity of Non-Returning Context-Free PC Grammar Systems

Improving the previously known best bound, we show that any recursively enumerable language can be generated with a non-returning parallel communicating (PC) grammar system having six contextfree components. We also present a non-returning universal PC grammar system generating unary languages, that is, a system where not only the number of components, but also the number of productions and the...

متن کامل

Dimensioning large-scale service systems with returning patients

Designing cost-effective service processes in hospitals presents tremendous challenges, and due to tightening budgets this topic is very much alive. We introduce a new queueing model that can be used for dimensioning both the number of beds and the number of nurses in an Emergency Department. We scale this system in the Quality-and-Efficiency-Driven regime which can achieve both server efficien...

متن کامل

Packing Non-Returning A-Paths

Chudnovsky et al. gave a min-max formula for the maximum number of node-disjoint non-zero A-paths in group-labeled graphs [1], which is a generalization of Mader’s theorem on node-disjoint A-paths [3]. Here we present a further generalization with a shorter proof. The main feature of Theorem 2.1 is that parity is “hidden” inside ν̂, which is given by an oracle for non-bipartite matching.

متن کامل

On the Degree Complexity of Special Non-Context-Free Languages with Respect to PC Grammar Systems

When modeling natural languages, three languages are of special interest. In natural languages, there occur phenomena like multiple agreements, crossed agreements and replication. These aspects are represented by the three languages K1 = {abc |n ≥ 1}, K2 = {abcd |m,n ≥ 1} and K3 = {ww |w ∈ {a, b}}, respectively. In the present paper, we give parallel communicating grammar systems (PC grammar sy...

متن کامل

Returning Home

Returning to one's home country after many years abroad is a life-changing decision that brings with it many challenges, but at the same time, many rewards.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 1998

ISSN: 0304-3975

DOI: 10.1016/s0304-3975(97)00120-5